[bky373] Add Week 12 Solutions #195
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
DaleSeo
approved these changes
Jul 21, 2024
unique-paths/bky373.java
Outdated
| @@ -0,0 +1,20 @@ | |||
| // time: O(m*n) | |||
| // space: O(m*n) | |||
There was a problem hiding this comment.
이미 잘 푸셨지만, 메모리 최적화를 해서 공간 복잡도를 향상시킬 수 있는지 생각해보시면 좋을 것 같아용.
There was a problem hiding this comment.
아 space 복잡도를 더 줄일 수 있는 방법이 있군요 달레님 풀이 참고하였습니다 감사합니다! 🙇
060ae77
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Longest Increasing Subsequence
Unique Paths
Longest Common Subsequence
Maximum Subarray
Jump Game